Maximum flow problem

Results: 146



#Item
61Online Client-Server Load Balancing Without Global Information Baruch Awerbuch ∗ Mohammad T. Hajiaghayi †  Abstract

Online Client-Server Load Balancing Without Global Information Baruch Awerbuch ∗ Mohammad T. Hajiaghayi † Abstract

Add to Reading List

Source URL: www.cs.jhu.edu

Language: English - Date: 2007-10-09 11:18:46
62Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs ´ Colin de Verdi`ere Eric ´ Ecole

Shortest Vertex-Disjoint Two-Face Paths in Planar Graphs ´ Colin de Verdi`ere Eric ´ Ecole

Add to Reading List

Source URL: www.di.ens.fr

Language: English - Date: 2011-03-29 05:33:44
63Testable Implications of Linear Structural Equation Models Bryant Chen Jin Tian  Judea Pearl

Testable Implications of Linear Structural Equation Models Bryant Chen Jin Tian Judea Pearl

Add to Reading List

Source URL: www.cs.iastate.edu

Language: English - Date: 2014-04-22 14:09:42
64Practical Declarative Network Management Timothy Hinrichs Natasha Gude  Martin Casado

Practical Declarative Network Management Timothy Hinrichs Natasha Gude Martin Casado

Add to Reading List

Source URL: theory.stanford.edu

Language: English - Date: 2010-03-09 22:02:42
65Pattern Graphs: A Knowledge-Based Tool for Multivariate Temporal Pattern Retrieval Sebastian Peter∗ , Frank H¨oppner† and Michael R. Berthold∗ ∗ Nycomed-Chair  for Bioinformatics and Information Mining, Universi

Pattern Graphs: A Knowledge-Based Tool for Multivariate Temporal Pattern Retrieval Sebastian Peter∗ , Frank H¨oppner† and Michael R. Berthold∗ ∗ Nycomed-Chair for Bioinformatics and Information Mining, Universi

Add to Reading List

Source URL: public.fh-wolfenbuettel.de

Language: English - Date: 2013-08-17 10:02:26
66Multicommodity Flow, Well-linked Terminals, and Routing Problems

Multicommodity Flow, Well-linked Terminals, and Routing Problems

Add to Reading List

Source URL: www.cse.iitd.ernet.in

Language: English - Date: 2011-04-25 01:32:00
67It’s About Time: On Optimal Virtual Network Embeddings under Temporal Flexibilities ∗ Internet Matthias Rost∗ , Stefan Schmid∗† , Anja Feldmann∗ Network Architectures, Technische Universität Berlin, Germany

It’s About Time: On Optimal Virtual Network Embeddings under Temporal Flexibilities ∗ Internet Matthias Rost∗ , Stefan Schmid∗† , Anja Feldmann∗ Network Architectures, Technische Universität Berlin, Germany

Add to Reading List

Source URL: www.net.t-labs.tu-berlin.de

Language: English - Date: 2014-10-15 13:33:26
68Piggybacking on Social Networks∗ Aristides Gionis Flavio Junqueira  Vincent Leroy

Piggybacking on Social Networks∗ Aristides Gionis Flavio Junqueira Vincent Leroy

Add to Reading List

Source URL: www.vldb.org

Language: English - Date: 2013-06-29 06:26:37
69August 26, 2002  TR CS[removed]Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks

August 26, 2002 TR CS[removed]Maximum Lifetime Data Gathering and Aggregation in Wireless Sensor Networks

Add to Reading List

Source URL: www.csee.umbc.edu

Language: English - Date: 2002-09-16 11:44:39
70COMS21103  Given a (weighted, directed) graph G and a pair of vertices s and t, we would like to find a shortest path from s to t. A fundamental task with many applications:

COMS21103 Given a (weighted, directed) graph G and a pair of vertices s and t, we would like to find a shortest path from s to t. A fundamental task with many applications:

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-01-08 09:09:07